Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
نویسندگان
چکیده
منابع مشابه
Efficient storage of Pareto points in biobjective mixed integer programming
In biobjective mixed integer linear programs (BOMILPs), two linear objectives are minimized over a polyhedron while restricting some of the variables to be integer. Since many of the techniques for finding or approximating the Pareto set of a BOMILP use and update a subset of nondominated solutions, it is highly desirable to efficiently store this subset. We present a new data structure, a vari...
متن کاملFinding equidistant nondominated points for biobjective mixed integer programs
The nondominated frontier of a multiobjective optimization problem can be overwhelming to a decision maker, as it is often either exponential or infinite in size. Instead, a representation of this set in the form of a small sample of points is often preferred. In this paper we present a new biobjective criterion space search method for generating a small set of equidistant points based on the s...
متن کاملBranch-and-bound for biobjective mixed-integer programming
We present a generic branch-and-bound method for finding all the Pareto solutions of a biobjective mixed integer program. Our main contribution is new algorithms for obtaining dual bounds at a node, for checking node fathoming, presolve and duality gap measurement. Our various procedures are implemented and empirically validated on instances from literature and a new set of hard instances. We a...
متن کاملALTERNATIVE MIXED INTEGER PROGRAMMING FOR FINDING EFFICIENT BCC UNIT
Data Envelopment Analysis (DEA) cannot provide adequate discrimination among efficient decision making units (DMUs). To discriminate these efficient DMUs is an interesting research subject. The purpose of this paper is to develop the mix integer linear model which was proposed by Foroughi (Foroughi A.A. A new mixed integer linear model for selecting the best decision making units in data envelo...
متن کاملSolving the Air Conflict Resolution Problem Under Uncertainty Using an Iterative Biobjective Mixed Integer Programming Approach
In this paper, we tackle the aircraft conflict resolution problem under uncertainties. We consider errors due to the wind effect, the imprecision on the aircraft speed prediction, and the delay in the execution of maneuvers. Using a geometrical approach, we derive an analytical expression for the minimum distance between aircraft, along with the corresponding probability of conflict. These expr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2018
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.2017.0783